Susceptibility in subcritical random graphs
نویسندگان
چکیده
We study the evolution of the susceptibility in the subcritical random graph G n , p as n tends to infinity. We obtain precise asymptotics of its expectation and variance and show that it obeys a law of large numbers. We also prove that the scaled fluctuations of the susceptibility around its deterministic limit converge to a Gaussian law. We further extend our results to higher moments of the component size of a random vertex and prove that they are jointly asymptotically normal. © 2008 American Institute of Physics. DOI: 10.1063/1.2982848
منابع مشابه
Susceptibility of Random Graphs with given Vertex Degrees
We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In the supercritical case, a corresponding result holds for the modified susceptibility ignoring the giant component and the expected size of a finite cluster ...
متن کاملAsymptotic Study of Subcritical Graph Classes
We present a unified general method for the asymptotic study of graphs from the so-called “subcritical” graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works both in the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from ...
متن کاملDuality in inhomogeneous random graphs, and the cut metric
The classical random graph model G(n, λ/n) satisfies a ‘duality principle’, in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved for various models; they are useful since it is often much easier to study the subcritical model than to directly study small components in the supercritical model...
متن کاملBirth control for giants
The standard Erdős-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n2 rounds as one time unit, a phase transition occurs at t = 1 when a giant component (one of size constant time n) first appears. Under the influence of statistical mechanics, the investigation of related phase transitions has become an important topic in ran...
متن کاملConvergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs
This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, V ertex Separation, Edge Bisection and V ertex Bisection. For full square lattices, we give optimal layouts for the problems still...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008